A note on transfinite ordinals
نویسندگان
چکیده
منابع مشابه
Some New Properties of Transfinite Ordinals
1 Presented to the Society, December 27, 1939. The author is indebted to Professor W. A. Hurwitz for his indispensable advice in the preparation of this paper. 2 W. Sierpinski, Leçons sur les Nombres Transfinis, Paris, 1928, p. 202; hereafter referred to as Sierpinski (I). The theorem was first stated for ordinals of the first and second ordinal class by G. Cantor, Beitrdge zur Begründung der t...
متن کاملTransfinite Ordinals in Recursive Number Theory
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملOrdinals in HOL: Transfinite Arithmetic up to (and Beyond) ω 1
We describe a comprehensive HOL mechanisation of the theory of ordinal numbers, focusing on the basic arithmetic operations. Mechanised results include the existence of fixpoints such as ε0, the existence of normal forms, and the validation of algorithms used in the ACL2 theorem-proving system.
متن کاملA pr 2 00 1 A Note on Transfinite M Theory and the Fine Structure Constant
In this short note , using notions from p-Adic QFT and p-branes, we derive the transfinite M theoretical corrections (αM ) −1 = 100+61φ to El Naschie’s inverse fine structure constant value (αHS) −1 = 100+ 60φ which was based on a transfinite Heterotic string theory ormalism . φ is the Golden Mean 0.6180339.... Our results are consistent with recent Astrophysical observations of he Boomerang an...
متن کاملTuring computations on ordinals
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel’s constructible universe L. This characterization can be used to prove the generalized continuum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1931
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1931-05283-6